EVALUATION OF SERVICE-ORIENTED APPLICATION SCALABILITY FOR SOLVING BOOLEAN SATISFIABILITY PROBLEMS
نویسندگان
چکیده
منابع مشابه
On Solving Optimization Problems Using Boolean Satisfiability
The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful deployment of SAT solvers in a wide range of problems in Engineering and Computer Science. In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF). While this input format is applicable to some engineering ta...
متن کاملSolving the Satisfiability Problem through Boolean Networks
$EVWUDFW. In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new a...
متن کاملSuitability of Service Oriented Architecture for Solving Gis Problems
Nowadays spatial data is becoming as a key element for effective planning and decision making in all aspects of societies. Spatial data are those data which are related to the features on the ground. In this way, a Geographic Information System (GIS) is a system that captures, analyzes, and manages any spatially referenced data. This paper analyzes the architecture and main features of Geograph...
متن کاملAlgorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is in the core of algorithms for solving Binate Covering Problems. This paper describes how Boolean Satisfiability ...
متن کاملGeneralized Craig Interpolation for Stochastic Boolean Satisfiability Problems
The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, among them bounded model checking (BMC) of symbolically represented Markov decision processes. This paper identifies a notion of Craig interpolant for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Фундаментальные исследования (Fundamental research)
سال: 2017
ISSN: 1812-7339
DOI: 10.17513/fr.41974